A new branch and bound algorithm for integer quadratic programming problems
نویسندگان
چکیده
منابع مشابه
A novel branch-and-bound algorithm for quadratic mixed-integer problems with quadratic constraints
The efficient numerical treatment of convex quadratic mixed-integer optimization poses a challenging problem for present branch-and-bound algorithms. We introduce a method based on the duality principle for nonlinear convex problems to derive suitable bounds that can be directly exploit to improve heuristic branching rules. Numerical results indicate that the bounds allow the branch-and-bound t...
متن کاملA new branch-and-bound algorithm for standard quadratic programming problems
In this paper we propose convex and LP bounds for Standard Quadratic Programming (StQP) problems and employ them within a branch-and-bound approach. We first compare different bounding strategies for StQPs in terms both of the quality of the bound and of the computation times. It turns out that the polyhedral bounding strategy is the best one to be used within a branch-and-bound scheme. Indeed,...
متن کاملA Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
This paper develops a linear programming based branch-and-bound algorithm for mixed integer conic quadratic programs. The algorithm is based on a higher dimensional or lifted polyhedral relaxation of conic quadratic constraints introduced by Ben-Tal and Nemirovski. The algorithm is different from other linear programming based branch-and-bound algorithms for mixed integer nonlinear programs in ...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nonlinear Sciences and Applications
سال: 2016
ISSN: 2008-1901
DOI: 10.22436/jnsa.009.03.42